翻訳と辞書 |
Counter automaton : ウィキペディア英語版 | Counter automaton
In computer science, a counter automaton is a Pushdown automaton with only two symbols, ''A'' and the initial symbol in (the finite set of stack symbols). This class of automata can recognize a subset of Context free languages, for instance the language:
To accept the above language, let ''x'' be a word on the form above. The automaton can use the symbol A to count the number of ''as in ''x'' (writing an ''A'' for each ''a'' in ''x'') and deleting an ''A'' for each ''b'' in ''x''.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Counter automaton」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|